An Improved Two-Dimensional Run-Length Encoding Scheme and Its Application

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mespotine-RLE-basic v0.9 - An overhead-reduced and improved Run-Length-Encoding Method

Run Length Encoding(RLE) is one of the oldest algorithms for data-compression available, a method used for compression of large data into smaller and therefore more compact data. It compresses by looking at the data for repetitions of the same character in a row and storing the amount(called run) and the respective character(called run_value) as target-data. Unfortunately it only compresses wit...

متن کامل

An Overview of Run-length Encoding of Handwritten Word Images

Analysis of handwritten word images is closely tied to the method of representing the images. Diierent representations have their own sets of advantages and disadvantages. In this paper, we propose a novel method of encoding handwritten images using vertical runs that signiicantly simpliies the implementation of several image-processing tasks pertaining to handwriting recognition. We demonstrat...

متن کامل

The Number of the Two Dimensional Run Length Constrained Arrays

First, a new framework describing the transfer matrices for the two dimensional run length constrained arrays (codes) is introduced, and some important properties of the transfer matrices ( 1) m T m  are derived in this framework. Then, using these properties, it is shown that the numbers ( , ) ( , 1) N m n m n  of the two dimensional binary arrays satisfying the (1, )  run length constraint...

متن کامل

On the capacity of two-dimensional run-length constrained channels

Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...

متن کامل

Run-length Encoding on Graphics Hardware

In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Signal Processing, Image Processing and Pattern Recognition

سال: 2016

ISSN: 2005-4254,2005-4254

DOI: 10.14257/ijsip.2016.9.4.30